Two Arithmetic for Normal Form

Two Sudoku Rules in Conjunctive Normal Form

The incremental satisfiability problem for a two conjunctive normal form

We propose a novel method to review K ` φ when K and φ are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can be solved in polynomial time. Keyword: Satisfiability Problem, Incremental Satisfiability Problem, 2SAT, Entail Propositional Problem, Efficient Satisfiability Instances.

Computing Normal Form Perfect Equilibria for Extensive Two-person Games

This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector ...

Center bifurcation for Two-Dimensional Border-Collision Normal Form

In this work we study some properties associated with the bordercollision bifurcations in a two-dimensional piecewise linear map in canonical form, related to the case in which a …xed point of one of the linear maps has complex eigenvalues and undergoes a center bifurcation when its eigenvalues pass through the unit circle. This problem is faced in several applied piecewise smooth models, such ...

A Normal Form for Braids

We present a seemingly new normal form for braids, where every braid is expressed using a word in a regular language on some simple alphabet of elementary braids. This normal form stems from analysing the geometric action of braid groups on curves in a punctured disk.